Combinatorial group theory

Results: 87



#Item
61The San Francisco Call (San Francisco[removed]p 5]

The San Francisco Call (San Francisco[removed]p 5]

Add to Reading List

Source URL: navsource.org

Language: English - Date: 2011-02-22 12:47:13
62THE FOUR NUMBERS GAME, WEEK 2 MATTHEW TAI We return to the question of whether we can go backwards. After some experimentation, we realized that we could go backwards if one of the entries was the sum of the other three

THE FOUR NUMBERS GAME, WEEK 2 MATTHEW TAI We return to the question of whether we can go backwards. After some experimentation, we realized that we could go backwards if one of the entries was the sum of the other three

Add to Reading List

Source URL: www.themathcircle.org

Language: English - Date: 2007-10-20 22:30:07
63Report on DIMACS∗ Working Group on Data De-Identification, Combinatorial Optimization, Graph Theory, and the Stat/OR Interface Date of Working Group Meeting: November 9, 2004 Working Group Organizers: Larry Cox, CDC

Report on DIMACS∗ Working Group on Data De-Identification, Combinatorial Optimization, Graph Theory, and the Stat/OR Interface Date of Working Group Meeting: November 9, 2004 Working Group Organizers: Larry Cox, CDC

Add to Reading List

Source URL: dimacs.rutgers.edu

Language: English - Date: 2005-12-07 09:02:22
64Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory Ben Brubaker, Daniel Bump and Solomon Friedberg Department of Mathematics, MIT, Cambridge MA[removed], USA Department of Mathematics, Stanford Universit

Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory Ben Brubaker, Daniel Bump and Solomon Friedberg Department of Mathematics, MIT, Cambridge MA[removed], USA Department of Mathematics, Stanford Universit

Add to Reading List

Source URL: sporadic.stanford.edu

Language: English - Date: 2011-06-09 18:39:10
65

PDF Document

Add to Reading List

Source URL: www.xinnix.com

Language: English - Date: 2013-11-08 17:42:45
66Persuasive Speaker Press A t l a n t a ,  G e o r g i a

Persuasive Speaker Press A t l a n t a , G e o r g i a

Add to Reading List

Source URL: www.speechworks.net

Language: English - Date: 2013-02-23 13:55:03
67[removed]A Fast Method for Comparing Braids Patrick DEHORNOY

[removed]A Fast Method for Comparing Braids Patrick DEHORNOY

Add to Reading List

Source URL: www.math.unicaen.fr

Language: English - Date: 2005-09-07 10:03:11
68COMPLETE POSITIVE GROUP PRESENTATIONS PATRICK DEHORNOY Abstract. A combinatorial property of positive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presenta

COMPLETE POSITIVE GROUP PRESENTATIONS PATRICK DEHORNOY Abstract. A combinatorial property of positive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presenta

Add to Reading List

Source URL: www.math.unicaen.fr

Language: English - Date: 2002-04-30 03:56:35
69HOMOLOGY OF GAUSSIAN GROUPS HOMOLOGIE DES GROUPES GAUSSIENS PATRICK DEHORNOY AND YVES LAFONT Abstract. We describe new combinatorial methods for constructing explicit free resolutions of Z by ZG-modules when G is a group

HOMOLOGY OF GAUSSIAN GROUPS HOMOLOGIE DES GROUPES GAUSSIENS PATRICK DEHORNOY AND YVES LAFONT Abstract. We describe new combinatorial methods for constructing explicit free resolutions of Z by ZG-modules when G is a group

Add to Reading List

Source URL: www.math.unicaen.fr

Language: English - Date: 2003-03-19 10:52:23
70[removed]COMBINATORIAL DISTANCE BETWEEN BRAID WORDS PATRICK DEHORNOY Abstract. We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.

[removed]COMBINATORIAL DISTANCE BETWEEN BRAID WORDS PATRICK DEHORNOY Abstract. We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.

Add to Reading List

Source URL: www.math.unicaen.fr

Language: English - Date: 2009-06-20 10:20:03